A PURELY SYNTACTIC AND CUT-FREE SEQUENT CALCULUS FOR THE MODAL LOGIC OF PROVABILITY
نویسندگان
چکیده
منابع مشابه
Sequent Calculus 3.1 Cut-free Sequent Calculus
In the previous chapter we developed linear logic in the form of natural deduction , which is appropriate for many applications of linear logic. It is also highly economical, in that we only needed one basic judgment (A true) and two judgment forms (linear and unrestricted hypothetical judgments) to explain the meaning of all connectives we have encountered so far. However, it is not immediatel...
متن کاملSequent Calculus 3.1 Cut-free Sequent Calculus
In the previous chapter we developed linear logic in the form of natural deduction , which is appropriate for many applications of linear logic. It is also highly economical, in that we only needed one basic judgment (A true) and two judgment forms (linear and unrestricted hypothetical judgments) to explain the meaning of all connectives we have encountered so far. However, it is not well-suite...
متن کاملA Cut-Free Sequent Calculus for Bi-intuitionistic Logic
Abstract. Bi-intuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Bi-intuitionistic logic was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent “cut-free” sequent calculus for BiInt has recently been shown by Uustalu to fail cut-elimination. We present a new cut-free sequent calculus for BiInt, and...
متن کاملCut - Free Sequent Calculus For
We aim at an exposition of some nonstandard cut-free Gentzen formalization for S5, called DSC (double sequent calculus). DSC operates on two types of sequents instead of one, and shifting of wffs from one side of sequent to another is regulated by special rules and subject to some restrictions. Despite of this apparent inconvenience it seems to be simpler than other, known Gentzen-style systems...
متن کامل0 N ov 2 01 7 A Cut - free sequent calculus for modal logic S 5 ∗ †
Providing a cut-free sequent calculus for S5 has a long history. The efforts in this direction are numerous, and each of them presents some difficulties. In this paper, we present a sequent calculus system for modal logic S5. It has in a sense subformula property. We show that the cut rule is admissible in this system.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Review of Symbolic Logic
سال: 2009
ISSN: 1755-0203,1755-0211
DOI: 10.1017/s1755020309990244